Combinatorial Optimization and Integer Linear Programming Combinatorial Optimization
نویسندگان
چکیده
Examples: Shortest Path, Traveling Salesman, and many many more. . . Just in bioinformatics: Alignments, Threading, Clone-Probe Mapping, Probe Selection, De Novo Peptide Sequencing, SideChain Placement, Maximum-weight Connected Subgraph in PPI Networks, Genome Rearrangements, Cluster Editing, Finding Regulatory Modules, Finding Approximate Gene Clusters, Haplotyping, and many more. . . Example. Optimal Microarray Probe Selection Experimental setup (group testing): • Goal: determine presence of targets in sample • probes hybridize with targets→ hybridization pattern
منابع مشابه
Combinatorial Optimization in Computational Biology
Combinatorial Optimization is a central sub-area in Operations Research that has found many applications in computational biology. In this talk I will survey some of my research in computational biology that uses graph theory, matroid theory, and integer linear programming. The biological applications come from haplotyping, the study of recombination and recombination networks, and phylogenetic...
متن کاملNASA Technical Memorandum 110210 Aerospace Applications of Integer and Combinatorial Optimization
Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to inter...
متن کاملCardinality constrained combinatorial optimization: Complexity and polyhedra
Given a combinatorial optimization problem and a subset N of natural numbers, we obtain a cardinality constrained version of this problem by permitting only those feasible solutions whose cardinalities are elements of N . In this paper we briefly touch on questions that addresses common grounds and differences of the complexity of a combinatorial optimization problem and its cardinality constra...
متن کاملTechnical Report Integer Programming 1 Integer Programming 4
1 To appear as a chapter of the Handbook of Algorithms edited by M. Abstract Integer programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture ...
متن کاملUniversally Balanced Combinatorial Optimization Games
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivis...
متن کاملInterior Point and Semidefinite Approaches in Combinatorial Optimization
Conic programming, especially semidefinite programming (SDP), has been regarded as linear programming for the 21st century. This tremendous excitement was spurred in part by a variety of applications of SDP in integer programming (IP) and combinatorial optimization, and the development of efficient primal-dual interior-point methods (IPMs) and various first order approaches for the solution of ...
متن کامل